Systems and methods for improved generation of textual directions based on positional information

ABSTRACT

Systems and methods are provided for providing improved generation of textual directions based on positional information. In an implementation, textual directions for traversing a path are generated based on positional information associated with the path. According to a method, positional information that specifies a longitude and latitude at a plurality of times is received and processed to generate a routing graph. The generated routing graph includes nodes and route links that connect the plurality of nodes. Textual directions are generated for traversing a path associated with the positional data, based in part on link information associated with the links of the generated routing graph.

BACKGROUND

1. Technical Field

The present disclosure generally relates to techniques for generatingand presenting textual directions for traversing a path through ageographic region. In particular, and without limitation, the presentdisclosure relates to systems and methods for providing improvedtechniques that generate textual directions based on positionalinformation.

2. Background Information

Today, modules capable of receiving and capturing signals from a globalpositional position system (GPS) are incorporated into in many commonelectronic devices, including personal navigation systems, mobiletelephones, smart phones, personal media players, watches, automotivenavigation systems, laptop and notebook computers. In addition toconveying driving and/or walking directions to a user, theseGPS-equipped devices can also receive and store GPS position data, sucha latitude, longitude, and elevation, for future download andmanipulation. For example, a bicyclist may use a GPS-equipped mobiletelephone to record GPS position data throughout a scenic bicycle ride.

Further, electronic map displays are widely used to convey informationabout roads, traffic, buildings, landmarks, terrain, etc. related to aparticular geographical region of interest. Because of theirversatility, electronic map displays are incorporated in a variety ofdifferent computer systems and applications. For example, electronic mapinterfaces are available from variety of Internet resources for use bythe public.

Such Internet-based electronic map displays often allow a user to uploadand manipulate GPS position data after capture by a GPS-equippedpersonal electronic device. These resources can plot uploaded GPS dataon corresponding street maps, topographical maps, and/or street imagesfor viewing and subsequent transmittal to other users of GPS-equippeddevices. For example, the bicyclist can upload recorded GPS datacorresponding to the scenic ride, process that data, and share that datawith others who use similar GPS-devices and are interested in path takenduring the scenic ride.

However, there are drawbacks associated with these Internet-basedresources. In particular, while these resources permit the display ofstored GPS data on corresponding maps, these resources often lack afacility for directly translating uploaded GPS positional data intotextual directions for traversing a corresponding path. As such, usersof these resources may be limited in their ability to share informationderived from uploaded GPS data with other interested parties.

In view of the foregoing, there is a need for improved systems andmethods for automatically generating textual directions for traversing aroute. Such systems and methods may be implemented in computer-basedenvironments, such as the Internet and network environments that provideonline content to users.

SUMMARY

Consistent with embodiments of the present invention, acomputer-implemented method is provided for generating textualdirections based on positional data. The method receives positionalinformation, the positional information including a plurality ofpositional data elements that specify a longitude and latitude at acorresponding plurality of times. The method then processes the receivedpositional information to generate a routing graph. The routing graphincludes a plurality of nodes and one or more route links that connectthe plurality of nodes, and the one or more route links are associatedwith corresponding link information. The method then generates textualdirections for traversing a path based on the corresponding linkinformation.

Consistent with additional embodiments of the present invention, anapparatus having a storage device and a processor coupled to the storagedevice is provided. The storage device stores a program for controllingthe processor, and the processor, being operative with the program, isconfigured to receive positional information, the positional informationincluding a plurality of positional data elements that specify alongitude and latitude at a corresponding plurality of times. Theprocessor is further configured to process the received positionalinformation to generate a routing graph. The routing graph includes aplurality of nodes and one or more route links that connect theplurality of nodes, and the one or more route links are associated withcorresponding link information. The processor is configured to generatetextual directions for traversing a path based on the corresponding linkinformation.

Other embodiments of the present invention relate to a computer-readablemedium with stored instructions that, when executed by a processor,perform a method for generating textual directions based on receivedpositional data. The method receives positional information, thepositional information including a plurality of positional data elementsthat specify a longitude and latitude at a corresponding plurality oftimes. The method then processes the received positional information togenerate a routing graph. The routing graph includes a plurality ofnodes and one or more route links that connect the plurality of nodes,and the one or more route links are associated with corresponding linkinformation. The method then generates textual directions for traversinga path based on the corresponding link information.

It is to be understood that both the foregoing general description andthe following detailed description are exemplary and explanatory only,and are not restrictive of the invention. Further, the accompanyingdrawings, which are incorporated in and constitute a part of thisspecification, illustrate embodiments of the invention and together withthe description, serve to explain principles of the invention.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a diagram of an exemplary computing environment within whichembodiments of the invention may be practiced.

FIG. 2 is a diagram of an exemplary computer system, consistent withembodiments of the invention.

FIG. 3 is a flowchart of an exemplary method for generating textualdirections based on positional information, according to an embodimentof the invention.

FIG. 4 is an exemplary set of positional information, consistent withembodiments of the invention.

FIG. 5 is an exemplary routing graph, consistent with embodiments of theinvention.

FIG. 6 is an exemplary set of textual directions, consistent withembodiments of the invention.

FIG. 7 is a flowchart of an exemplary method for generating a routinggraph based on positional information, according to an embodiment of theinvention.

FIG. 8 is a flowchart of an exemplary method for determining whetherroads associated with a pair of positions are directly connected,according to an embodiment of the invention.

FIG. 9 is a flowchart of an exemplary method for generating a routinggraph based on subsets of positional information, according to anadditional embodiment of the invention.

FIG. 10 is a flowchart of an exemplary method for generating portions ofa routing graph based on previously-correlated positional information,according to an embodiment of the invention.

FIG. 11 is a flowchart of an exemplary method for generating textualdirections based on a routing graph, according to an embodiment of theinvention.

FIG. 12 illustrates an exemplary structure for storing road network datawithin the exemplary computing environment of FIG. 1, consistent withembodiments of the invention.

DESCRIPTION OF THE EMBODIMENTS

Reference will now be made in detail to embodiments of the invention,examples of which are illustrated in the accompanying drawings. The samereference numbers will be used throughout the drawings to refer to thesame or like parts.

In this application, the use of the singular includes the plural unlessspecifically stated otherwise. In this application, the use of “or”means “and/or” unless stated otherwise. Furthermore, the use of the term“including,” as well as other forms such as “includes” and “included,”is not limiting. In addition, terms such as “element” or “component”encompass both elements and components comprising one unit, and elementsand components that comprise more than one subunit, unless specificallystated otherwise. Additionally, the section headings used herein are fororganizational purposes only, and are not to be construed as limitingthe subject matter described.

FIG. 1 illustrates an exemplary computing environment 100 within whichembodiments of the present invention may be practiced. In FIG. 1, a mapsystem 160, a client device 102, and a mobile client device 112 areinterconnected via a communications network 130. In an embodiment,client devices 102 and 112 can include, but are not limited to, apersonal computer, a laptop computer, a notebook computer, a hand-heldcomputer, a personal digital assistant, a portable navigation device, amobile phone, a smart phone, and any additional or alternate computingdevice apparent to a person of ordinary skill in the art. Althoughcomputing environment 100 includes multiple client devices incommunication with map system 160, persons of ordinary skill in the artwill recognize that computer environment 100 may include any number ofadditional number of mobile or stationary client devices, any number ofadditional map systems (or servers), and any additional number ofcomputers, systems, or servers without departing from the spirit orscope of the present invention.

Communications network 130 may represent any form or medium of digitaldata communication. Examples of communication network 130 include alocal area network (“LAN”), a wireless LAN, e.g., a “WiFi” network, awireless Metropolitan Area Network (MAN) that connects multiple wirelessLANs, and a wide area network (“WAN”), e.g., the Internet. In theembodiments described herein, the Internet may include anypublicly-accessible network or networks interconnected via one or morecommunication protocols, including, but not limited to, hypertexttransfer protocol (HTTP) and transmission control protocol/internetprotocol (TCP/IP). Moreover, communications network 130 may also includeone or more mobile device networks, such as a GSM network or a PCSnetwork, that allow mobile devices, such as mobile client device 112, tosend and receive data via applicable communications protocols, includingthose described above.

In FIG. 1, map system 160 includes a map server 162 and a map database164, which is disposed in communication within map server 162. Forexample, map server 162 and map database 164 may be incorporated into asingle hardware unit, for example, a single computer or a single server.In such an embodiment, map database 164 may be incorporated into, orstored within, a storage medium or storage device of map server 162, asdescribed in FIG. 2. However, map server 162 and map database 164 arenot limited to such configurations, and, in additional embodiments, mapdatabase 164 may reside on any additional or alternate computer orserver accessible to map server 162 without departing from the spirit ofscope of the present invention.

Map database 164 includes map data 166 and route network data 168. In anembodiment, map data 166 can include one or more of cartographicinformation, geographic information, road information, satellite imageinformation, traffic information, and other information about one ormore geographical regions. For example, such road information mayinclude, but it not limited to, one or more names associated with aplurality of roads of a road network in a geographic region, andpositional information, e.g., longitude, latitude, and/or elevation, ofsegments of the plurality of roads.

Route network data 168 may include information identifying one or moresegments, or links, of routes for traversing the road network of thegeographic region. For example, such identifying link information mayinclude, but is not limited to, a length of one or more links, adirection of travel along the one or more links, names of the one ormore links, connectivity information, and information describing amaneuver required to enter or exit the one or more links.

In an embodiment, information associated with links in route networkdata 168 may be stored within map database 164 in a structured format.FIG. 12 illustrates an exemplary data structure 1270 for storing linkinformation associated with a particular route link in a road network.In an embodiment, link information associated with route links in routenetwork data 168 may be stored in map database 164 according to datastructure 1270.

In FIG. 12, link data structure 1270 includes a link identifier 1272, alink classification 1274, a computed turn angle 1276, a signed direction1278, sign information 1280, a road name 1282, an alternate road name1284, an internal link indicator 1286, a ramp indicator 1288, alimited-access indicator 1290, a distance 1292, an optional time 1294,and a compass direction 1296. Further, in FIG. 12, sign information 1280may include a toward-location 1280A, a branch-to-road 1280B, and an exitnumber 1280C. However, link data structure 1270 is not limited to theattributes and properties described above, and in additionalembodiments, link data structure 1270 may include any additional oralternate attributes or properties without departing from the spirit orscope of the invention.

In an embodiment, link identifier 1272 uniquely identifies a particularlink, and link classification 1274 identifies a type of roadcorresponding to that particular link. The type of road may include, butis not limited to, a fully-controlled limited access highway, apartially-controlled limited access highway, an arterial road, or alocal road.

Computed turn angle 1276 indicates a degree of an angle involved in aturn from the particular link to another link in the road network. Forexample, computed turn angle 1276 may include, but is not limited to, asharp left, a sharp right, a slight left, a slight right, a merge,straight, and any additional or alternate turn angle apparent to aperson or skill in the art.

Signed direction 1278 represents a travel direction of a road in theroad network that corresponds to the particular link, as indicated by,for example, posted signs along the road. In such an embodiment, signeddirection 1278 can include, but is not limited to, one of north, south,east or west.

Sign information 1280 may indicate information about one or more exitsigns associated with the particular link. In an embodiment, signinformation 1280 includes an indicator, e.g., toward-location 1280A,that identifies a city name or road name occurring along the road towhich the exit applies, an indicator, e.g., branch-to-road indicator12808, that identifies the road to which the exit applies, and an exitnumber for the exit, e.g., exit number 1280C.

In an embodiment, components 1280A, 12808, and 1280C of sign information1280 can describe sign information characteristic of an exit sign on alimited-access highway. For example, such an exit sign may indicate thatexit “21A” branches to “I-95 North” toward “New York.” In such anembodiment, the toward-location 1280A would be “New York,” thebranch-to-road indicator 1280B would be “I-95 North,” and the exitnumber 1280C would be “21A.”

In an additional embodiment, a link within the road network may includesign information 1210 that corresponds to one or more signs. Forexample, “I-95 North” may have multiple exit signs, each havingcorresponding sign information, e.g., sign information 1280, andcorresponding components 1280A, 12808, and 1280C.

Road name 1282 indicates a name of the road that corresponds to theparticular link. In an embodiment, link classification 1274, signeddirection 1278, and road name 1280 collectively identify that road inthe road network associated with the particular link. For example, aparticular road may be named “I-295 South.” In such an embodiment, thelink classification 1274 may be “fully-controlled Limited AccessHighway,” the signed direction 1278 may be “south,” and the road name1280 may be “295.”

Alternate road name 1284 indicates an alternate name of that road havingroad name 1282, when such an alternate name exists. For example, a roadmay have an alphabetical name (e.g., “Brandywine Road”), a road numberassigned by a state highway authority (e.g., “MD-381”), and additionallyor alternatively, a road number assigned by a national highwayauthority. Further, alternate road name 1282 may indicate multiplealternative road names associated with the particular road.

Internal link indicator 1286 may identify whether the particular link isan “internal link.” In an embodiment, an internal link represents a linkoccurring at an intersection of two or more doubly-digitized roads,i.e., two-way roads represented as two separate roads. For example, adoubly-digitized road, such as “Interstate-95,” may be represented as“Interstate-95 North” and “Interstate-95 South.”

Ramp indicator 1288 identifies whether the particular link correspondsto a ramp of a road, and limited-access indicator 1290 identifieswhether the particular link corresponds to a limited-access road. Forexample, an interstate highway may be characterized as a“fully-controlled limited-access road” in which access to and from theinterstate occurs through a highway interchange, and not through adirect intersection of two roads. In such an embodiment, such a highwayinterchange may include includes one or more exits and ramps.

Distance 1292 identifies a length of a segment of the road correspondingto the particular link, and optional time 1294 identifies an averagetime for traversing distance 1292. Further, compass direction 1296identifies a general direction of travel of a GPS-equipped device on theroad corresponding to the particular link. In an embodiment, compassdirection 1296 may be identical to, or different from, signed direction1276 of the particular link.

Link shape indicator 1298 identities a sequentially-ordered set ofpositions that fall along a curve or shape of a road associated with theparticular link. For example, each of the identified positions mayinclude a latitude and a longitude of the corresponding position alongthe particular link. However, in additional embodiments, thesequentially-ordered set of positions may also include additionalquantifies, such as an elevation of a position along the particularlink, without departing from the spirit or scope of the invention.

Referring back to FIG. 1, client devices 102 and 112, and map server162, may represent any type of computer system capable of performingcommunication protocol processing. FIG. 2 is an exemplary computersystem 200, according to an embodiment of the invention. Computer system200 includes one or more processors, such as processor 202. Processor202 is connected to a communication infrastructure 206, such as a bus ornetwork, e.g., network 130 of FIG. 1.

Computer system 200 also includes a main memory 208, for example, randomaccess memory (RAM), and may include a secondary memory 210. Secondarymemory 210 may include, for example, a hard disk drive 212 and/or aremovable storage drive 214, representing a magnetic tape drive, anoptical disk drive, CD/DVD drive, etc. The removable storage drive 214reads from and/or writes to a removable storage unit 218 in a well-knownmanner. Removable storage unit 218 represents a magnetic tape, opticaldisk, or other computer-readable storage medium that is read by andwritten to by removable storage drive 214. As will be appreciated, theremovable storage unit 218 can represent a computer-readable mediumhaving stored therein computer programs, sets of instructions, code, ordata to be executed by processor 202.

In alternate embodiments, secondary memory 210 may include other meansfor allowing computer programs or other program instructions to beloaded into computer system 200. Such means may include, for example, aremovable storage unit 222 and an interface 220. An example of suchmeans may include a removable memory chip (e.g., EPROM, RAM, ROM, DRAM,EEPROM, flash memory devices, or other volatile or non-volatile memorydevices) and associated socket, or other removable storage units 222 andinterfaces 220, which allow instructions and data to be transferred fromthe removable storage unit 222 to computer system 200.

Computer system 200 may also include one or more communicationsinterfaces, such as communications interface 224. Communicationsinterface 224 allows software and data to be transferred betweencomputer system 200 and external devices. Examples of communicationsinterface 224 may include a modem, a network interface (e.g., anEthernet card), a communications port, a PCMCIA slot and card, awireless transmitter or card, etc. Software and data may be transferredvia communications interface 224 in the form of signals 226, which maybe electronic, electromagnetic, optical or other signals capable ofbeing received by communications interface 224. These signals 226 areprovided to communications interface 224 via a communications path(i.e., channel 228). Channel 228 carries signals 226 and may beimplemented using wire or cable, fiber optics, an RF link, wirelesstransmissions, and other communications channels. In an embodiment ofthe invention, signals 226 comprise data packets sent to processor 202.Information representing processed packets can also be sent in the formof signals 226 from processor 202 through communications path 228.

The terms “storage device” and “storage medium” may refer to particulardevices including, but not limited to, main memory 208, secondary memory210, a hard disk installed in hard disk drive 212, and removable storageunits 218 and 222. Further, the term “computer-readable medium” mayrefer to devices including, but not limited to, a hard disk installed inhard disk drive 212, any combination of main memory 208 and secondarymemory 210, and removable storage units 218 and 222, which respectivelyprovide computer programs and/or sets of instructions to processor 202of computer system 200. Such computer programs and sets of instructionscan be stored within one or more computer readable media. Additionallyor alternatively, computer programs and sets of instructions may also bereceived via communications interface 224 and stored on the one or morecomputer readable media.

Such computer programs and instructions, when executed by processor 202,enable processor 202 to perform one or more of the computer-implementedmethods described herein. Examples of program instructions include, forexample, machine code, such as that code produced by a compiler, andfiles containing a high-level code that can be executed by processor 202using an interpreter.

The computer-implemented methods described herein can also beimplemented on a single processor of a computer system, such asprocessor 202 of system 200. In another embodiment, computer-implementedmethods consistent with embodiments of the invention may be implementedusing one or more processors within a single computer system, andadditionally or alternatively, these computer-implemented methods may beimplemented on one or more processors within separate computer systemslinked via a network.

Although not depicted in FIGS. 1 and 2, a client device, such as clientdevices 102 and 112, may be equipped with a receiver configured tointeract with a global positioning system (GPS) and receive dataregarding a position of the receiver at a particular time, that is, a“time stamp.” In an embodiment, the received position data may representa longitude and latitude of the GPS receiver. However, the received datais not limited to these values, and in additional embodiments, thereceived position data may include a current elevation of the GPSreceiver and derived quantities, such as a speed of the GPS receiver anda travel direction of the GPS receiver, without departing from thespirit or scope of the invention.

Moreover, GPS-equipped client devices may be configured to store thecontinuously-received sets of position data, along with thecorresponding time stamp. For example, these client devices can locallystore the received position and time stamp data on a storage device orstorage medium, such as secondary memory 200 of FIG. 2. Further, theseGPS-equipped client devices may be portable, for example, as carried byan individual on foot, on a bicycle, or in a moving vehicle. Thus, theseGPS-equipped devices are capable of recording position data whiletraversing a particular path a over period of time, thereby generating aset of positional information corresponding to a path over which theGPS-equipped device travelled.

Further, a user of such a GPS-equipped client device may wish to share aset of recorded positional information with other interested parties.For example, a cyclist may wish to share GPS-derived path datarepresentative of his training rides with a fellow rider. Further, forexample, drivers of fleet and/or delivery vehicles may share deliveryroutes with other drivers. In such embodiments, these parties may desiretextual directions that describe one or more maneuvers necessary totraverse a path or route corresponding to the recorded positionalinformation. However, such textual directions may not available fromconventional mapping systems based on inputs of raw positional dataalone.

FIG. 3 illustrates an exemplary method for generating textual directionsfrom positional information, according to an embodiment of theinvention. In FIG. 3, a set of positional information is received instep 302 by a map system, such as map system 160 of FIG. 1. In anembodiment, and as described above, the positional information mayinclude a plurality of data elements received and captured by aGPS-equipped device, and these data elements may be ordered sequentiallyaccording to a received time stamp.

For example, each of the stored data elements can include a time stampassociated with the data element, a latitude of the GPS-equipped device,and a longitude of the GPS-equipped device. However, in additionalembodiments, the plurality of data elements may include additionalinformation, for example, an elevation of the GPS-equipped device andderived quantities, such as a speed of the GPS-equipped device and acompass direction of the GPS-equipped device, without departing from thespirit or scope of the present invention.

FIG. 4 illustrates exemplary an exemplary set of positional information400, consistent with embodiments of the invention. In an embodiment,positional information 400 may have been captured and locally stored bya GPS-equipped client device, such as client devices 102 and 112 of FIG.1, and may have been received at the map server in step 302 of FIG. 3.

In FIG. 4, positional information 400 includes N individual positionaldata elements ordered sequentially according to a time stamp associatedwith each data element. For example, positional data element 402includes a latitude LAT₁ and a longitude LONG₁ of the GPS-equippedclient device at a time T₁. Similarly, for example, subsequentpositional data element 404 includes a latitude LAT₂ and a longitudeLONG₂ of the GPS-equipped client device at a time T₂, wherein T₂ islater than T₁. Further, positional data element 406 of the GPS-equippedclient device includes a latitude LAT_(N) and a longitude LONG_(N) ofthe GPS-equipped device at time T_(N), which is later than both T₁ andT₂. Moreover, as described above, each positional data element withinset 400 may include additional information, such as an elevation, andone or more derived quantities, such as a speed and/or a direction oftravel.

Referring back to FIG. 3, in an embodiment, step 302 receives positionalinformation 400 in a standardized file format compatible with both theGPS-equipped client device and the map server. For example, positionalinformation 400 may be provided to the map server in GPS eXchange (GPX)format, or alternatively, in Keyhole Markup Language. However, inadditional embodiments, positional information 400 may be provided tothe map server in any of a number of additional or alternate fileformats compatible with the map server and the GPS-equipped devicewithout departing from the spirit or scope of the present invention.

The received positional information is correlated in step 304 withstored map data (e.g., map data 166 of FIG. 1) and stored route networkdata (e.g., route network data 168 of FIG. 1) to generate a routinggraph representative of the received positional information. Forexample, step 304 may process positional information, e.g., longitudeand latitude, associated with one or more data elements in the receivedpositional information to identify a set of route links associated withthese one or more data elements. Step 304 then accesses link informationassociated with these identified route links, and processes the linkinformation to generate a routing graph that connects the identifiedroute links, thereby forming a corresponding route.

In additional embodiment, step 304 may also process the identified routelinks to eliminate “short loops” from the generated routing graph. In anembodiment, a “short loop” along the corresponding route represents atemporary reversal in direction along a single segment of road, i.e.,along a single route link. For example, a short loop within a routetraversed by a bicyclist can represent a bicyclist doubling back on asegment of road to wait for other riders. In such an embodiment, step304 may identify and eliminate a route link or links associated withthese “short loops,” and subsequently reconnect the remaining routelinks to generate the routing graph.

FIG. 5 illustrates an exemplary routing graph 500, consistent withembodiments of the present invention. In an embodiment, routing graph500 may be generated by step 304 through the correlation of receivedpositional information, e.g., positional information 400 of FIG. 4, withstored map data and stored route network data. In the embodiment of FIG.5, the received positional information can include a plurality ofpositions received and stored by a GPS-equipped client device as thatdevice travels along a path from “P St.” to “New Jersey Ave.”

Routing graph 500 extends from an origin node 502 on “P St.,” e.g., aninitial element within the received positional information, to adestination node 522 on “New Jersey Ave.,” e.g., a final element withinthe received positional information. In an embodiment, routing graph 500can be described in terms of a set of links, e.g., the route linksidentified in step 304, that are connected by corresponding nodes. Forexample, routing graph 500 includes origin node 502, interior nodes 504,506, 508, 510, 512, 514, 516, 518, 520, and destination node 522.Further, routing graph 500 also includes links 503, 505, 507, 509, 511,513, 515, 517, 519, and 521 that connect the nodes.

In an embodiment, a node on routing graph 500 can represent anintersection of directly-connected roads, which are represented byadjacent links. For example, node 512, which connects links 511 and 513,can represent the intersection of “Massachusetts Ave.” and “10^(th)St.,” which are directly connected.

Referring back to FIG. 3, step 306 then processes the routing graph,e.g., routing graph 500 of FIG. 5, to generate textual directions fortraversing the route represented by the routing graph. In an embodiment,step 306 processes and selectively combines the link informationassociated with the links of the routing graph to generate a preliminarylist of maneuvers for the route. As described above, such linkinformation may be stored within route network data 168 of FIG. 1. Step306 may then process and selectively combines the preliminary list ofmaneuvers to generate a list of processed maneuvers, from which themapping system generates textual directions.

FIG. 6 illustrates exemplary textual directions 600 for traversing thecorrelated route of FIG. 5, according to an embodiment of the invention.In an embodiment, textual directions 600 are generated using theexemplary processes of step 306 of FIG. 3, as described above. In FIG.6, textual directions 600 include narrative texts 602 through 620, whichrespectively describe a single maneuver necessary to traverse one ormore route links of the generated routing graph, e.g., routing graph 500of FIG. 5. Further, in the embodiment of FIG. 6, a first narrative text602 describes a maneuver corresponding to an initial position within therouting graph, e.g., node 502 of FIG. 5, and a final narrative text 620describes a maneuver that positioned the GPS-equipped client device atthe final position within the routing graph, e.g., node 522 of FIG. 5.

Referring back to FIG. 3, the textual directions generated in step 306may be stored in step 308 and may be transmitted and displayed to anadditional party in step 310. In an embodiment, the map system, e.g.,map system 160 of FIG. 1, can locally store the textual directions andany combination of the corresponding routing graph and the correspondingreceived positional information for future retrieval across acommunications network, e.g., communications network 130 of FIG. 1. Forexample, the map server may make such stored information available forretrieval by the party who transmitted the GPS positional information tothe map server, and additionally or alternatively, may make the storedinformation generally available to other parties through, for example, aweb site and corresponding web service. Further, in an embodiment, step310 may transmit the generated textual directions using any formapparent to a person of ordinary skill in the art, including, but notlimited to, email messages and text messages.

FIG. 7 illustrates an exemplary method 700 for generating a routinggraph based on received positional information, according to anembodiment of the invention. In an embodiment, method 700 is implementedas part of step 304 of FIG. 3 to generate a routing graph based on acorrelation of received positional information with stored map data andstored route network data. However, in additional embodiments, method700 may be independently implemented to generate a routing graphcorresponding to any additional or alternate set of position data thatincludes latitude and longitude data associated with individual timestamps.

In FIG. 7, step 702 processes the received positional information toidentify a first data element associated with a first position capturedat a corresponding first time. For example, the first data element mayrepresent an initial data element within the received positionalinformation, e.g., data element 402 of FIG. 4. However, method 700 isnot limited to such first data elements, and in additional embodiments,the first data element may represent any additional data element fromwithin the received positional information, e.g., a data elementcaptured at a particular time, without departing from the spirit orscope of the invention.

Step 704 then identifies a set of candidate roads within a stored roadnetwork, e.g., map data 172 of FIG. 1, that are proximate to the firstposition (e.g., those roads having corresponding curves or shapes thatare proximate to the first position). In an embodiment, the set ofcandidate roads may include one or more roads within the stored roadnetwork having any segment falling within a specified threshold distanceof the first position. For example, step 704 may compute a separationdistance between the first position and at least one position along oneor more roads in the stored road network. Step 704 may then include aroad within the set of candidate roads when the separation distanceassociated with that road falls below the specified threshold distance,e.g., ten meters, twenty-five meters, or any additional or alternatedistance apparent to one of skill in the art.

Step 706 then selects the road from within the identified set ofcandidate roads having a minimum separation distance (i.e., the roadthat is closest to the first position), and then indexes this selectedcandidate road against stored route network data, e.g., route networkdata 174 of FIG. 1, to identify a route ink associated with the selectedcandidate road. In an embodiment, step 706 may index the selectedcandidate road by matching a name of the candidate road againstcorresponding road names and/or alternate road names within stored routenetwork data 168 to a identify the route link.

As described above in reference to FIG. 12, the selected route link maybe associated with a link identifier that points to additionalinformation related to the link. Such additional information mayinclude, but is not limited to, a length of the identified route link, adirection of travel along a road corresponding to the identified routelink, a name of a road corresponding to the identified route link,connectivity information, and information describing a maneuver requiredto enter or exit from the identified route link.

Once step 706 identifies a route link associated with the initialposition of the received positional information, step 708 processes thereceived positional information to identify a second data elementcorresponding to a second position captured at a time after the firsttime. Step 708 also identifies a set of candidate roads within thestored road network that are proximate to the second position (e.g.,those roads having corresponding curves or shapes that are proximate tothe first position). As described above, step 708 may compute aseparation distance between the second position and at least oneposition along one or more roads in the stored road network. Step 708may then include a road in the set of candidate roads when theseparation distance associated with that road falls below a specifiedthreshold distance, e.g., ten meters, twenty-five meters, or anyadditional or alternate distance apparent to one of skill in the art.

In an embodiment, the second data element may represent a data elementcaptured by a GPS-equipped client device immediately after the firstdata element. However, method 700 is not limited to such second dataelements, and in additional embodiments, the second data element mayrepresent any additional or alternate data element captured later thanthe first data element. For example, the second data element may beseparated from the first data element by a particular number of elementsor by a particular time.

Step 710 then selects the road from within the identified set ofcandidate roads having a minimum separation distance (i.e., the roadthat is closest to the second position). Step 710 then indexes thisselected candidate road against stored route network data, e.g., routenetwork data 168 of FIG. 1, to identify a route link associated with theselected candidate road. In an embodiment, step 710 may index theselected candidate road by matching a name of the candidate road againstcorresponding road names and/or alternate road names within stored routenetwork data 168 to a identify the route link.

Moreover, in an embodiment, the identification of a route link in step710 may also determine whether a travel direction associated with theidentified route link matches a travel direction at the second position.For example, if the received positional information indicates theGPS-equipped client device was travelling eastbound at the secondposition, step 710 may not correlate that second position with a routelink to a westbound road (e.g., a westbound portion of afully-controlled, limited access highway) even if that road bestapproximates the second position. In such embodiments, step 710 may thenselect an alternate road from within the set of candidate roads having adirection that matches the travel direction of the second position.

However, in additional embodiments, the determination and remediation ofdirectional mismatches may be predicated on a nature of the receivedpositional information. For example, if the received positionalinformation corresponds to a path traversed by an individual on foot,then a directional mismatch may not be relevant and step 710 may notperform an alternate selection. However, if the received positionalinformation corresponds to a path traversed by a bicyclist or by a motorvehicle, then a direction mismatch may be relevant, and step 710 maymake an alternate road selection.

Step 712 then determines whether the roads selected for the first andsecond positions are directly connected. In an embodiment, step 710determines that the selected roads are directly connected when theseselected roads satisfy certain connectivity criteria, such as thosedescribed below in reference to FIG. 8.

FIG. 8 illustrates an exemplary method 800 for determining whether roadsassociated with a pair of positions satisfy certain connectivitycriteria, according to an embodiment of the invention. In an embodiment,method 800 may be implemented as a part of step 710 of FIG. 7 todetermine whether roads associated with a first and second position aredirectly connected. However, in additional embodiments, method 800 maybe implemented independently to determine whether any two road segmentssatisfy the certain connectivity criteria and as such, are directlyconnected.

In FIG. 8, step 802 accesses link identifiers of the route linksassociated with the pair of roads. As described above in reference toFIG. 7, step 802 may access the stored route network data to obtain linkidentifiers of the route links associated with the first and secondpositions.

Step 804 then determines whether the link identifiers for the pair ofroads match. If step 804 determines that the obtained link identifiersmatch, then the connectivity criteria are satisfied for the pair ofroads in step 806, and the roads are deemed directly connected. In suchan embodiment, each road is associated with the same route link, therebyimplying that each of the pair of positions is correlated to the sameroad segment. Once the connectivity criteria is satisfied in step 806,exemplary method 800 is complete and finishes in step 808.

However, if step 804 determines that the obtained link identifiers donot match, then each of the pair of positions is associated with adifferent road segment and as such, a different route link. Step 810then determines whether the road segments associated with the pair ofpositions are directly connected, i.e., whether the roads intersect. Inan embodiment, step 810 accesses stored connectivity informationassociated with each route link, and subsequently determines whethereach pair of roads is connected based on the accessed connectivityinformation.

If step 810 determines that the candidate roads associated with of thepair of positions are directly connected, i.e., that they intersect,then the connectivity criteria is satisfied in step 806. For example,and in reference to FIG. 5, “P Street” and “14^(th) Street” directlyintersect, and as such, links 503 and 505 satisfy the connectivitycriteria and are directly connected by node 504. In such an embodiment,method 800 is complete and finished in step 808.

However, if step 810 determines that the roads associated with of thepair of positions do not intersect, and as such, are not directlyconnected, then the connectivity criteria is not satisfied in step 812.For example, and in reference to FIG. 5, “P Street” does not directlyintersect “K Street,” and as such, links 503 and 517 fail to satisfy theconnectivity criteria and are not directly connected. In such anembodiment, method 800 is complete and finished in step 808.

Referring back to FIG. 7, if step 712 determines that the selected roadsare not directly connected (e.g., that the connectivity criteria of FIG.8 are not satisfied), step 714 discards the road selected for the secondposition. Step 716 then determines whether additional roads remain inthe set of candidate roads associated with the second position.

If step 716 determines that additional roads remain in the set ofcandidate roads associated with the second position, then method 700passes back to step 708. Step 708 selects an additional road from theset of candidate roads associated with the second position, and indexesthis selected candidate road against stored route network data toidentify a route link associated with the additional road. In anembodiment, the selected candidate road may represent that remainingroad within the set of candidate roads that is closest to the secondposition, as described above.

However, if step 716 determines that no roads remain within the set ofcandidate roads associated with the subsequent position, then step 718discards the second position, and method 700 passes back to step 708,which selects a new second data element having a corresponding secondposition from within the received positional information for furtherprocessing.

In such an embodiment, the newly-selected data element may immediatelyfollow the data element corresponding to the discarded position.However, in additional embodiments, the newly-selected data element maybe separated from the discarded element by a specified number ofelements, by a specified period of time, e.g., a number of seconds, orany combination thereof without departing from the spirit of scope ofthe invention.

However, if step 712 determines that the candidate roads are directlyconnected (e.g., that the connectivity criteria of FIG. 8 aresatisfied), then step 720 stores the corresponding route link or links,along with any corresponding linking node. Step 722 then determineswhether additional positions within the received positional informationrequire processing.

If step 722 determines that additional positions within the receivedpositional information require correlation with the stored map and routenetwork data, then step 724 sets the second position, selected above instep 710, as a new first position. Method 700 then loops back to step708, which selects a new second data element having a correspondingsecond position, and identifies a set of candidate roads that areproximate to the new second position, as described above.

However, if step 722 determines that each position within the receivedpositional information has been correlated with the stored map and routenetwork data, step 726 generates the routing graph corresponding to thereceived positional information from the stored route links andconnecting nodes, and method 700 is complete and finishes in step 728.In an embodiment, step 726 returns the generated routing graph/to step404 of FIG. 4 for additional processing.

In the embodiments described above, method 700 of FIG. 7 correlates eachposition in the received positional information with stored map data andstored route network data to identify a road proximate to each positionand a route link corresponding to that proximate road. However,conventional GPS receivers, such as those included within GPS-equippedclient devices 102 and 112 of FIG. 1, may receive and capture positiondata at a sampling rate of up to three samples per second. For example,for a path traversed over a sixty-minute interval, a GPS-equipped devicereceiving three samples per second would capture 10,800 data elements.In such instances, the selection and correlation of positions associatedwith these data elements may result in computationally-inefficientprocess for generating the routing graph.

FIG. 9 illustrates an exemplary method 900 for generating a routinggraph based on subsets of received positional information, according toan embodiment of the invention. In an embodiment, and similar to method700 of FIG. 7, method 900 may be implemented as part of step 404 of FIG.4 to correlate received positional information with stored map and routenetwork data to generate a routing graph. However, in an additionalembodiment, method 900 may be implemented independently to generate arouting graph corresponding to any additional or alternate set ofposition data.

However, in contrast to the exemplary methods of FIG. 8, method 900generates the routing graph based not on the correlation of individualdata elements within the received positional information, but on acorrelation of subsets of data elements within the received positiondata. Accordingly, the exemplary methods of FIG. 9 may result in a morecomputationally efficient generation process when applied to large setsof received positional information, e.g., those captured by GPS-equippedreceivers over long periods.

In FIG. 9, step 902 processes the received positional information toidentify a first data element, which is associated with a first positioncaptured at a corresponding first time. For example, the first dataelement may represent an initial data element within the receivedpositional information, e.g., data element 402 of FIG. 4. However,method 900 is not limited to such first data elements, and in additionalembodiments, the first data element may represent any additional dataelement from within the received positional information, e.g., a dataelement captured at a particular time, without departing from the spiritor scope of the invention.

Step 904 then identifies a set of candidate roads within a stored roadnetwork, e.g., map data 172 of FIG. 1, that are positioned proximate tothe first position (e.g., those roads having corresponding curves orshapes that are proximate to the first position). In an embodiment, theset of candidate roads may include one or more number of roads withinthe stored road network having any segment falling within a specifiedthreshold distance of the first position. For example, step 904 maycompute a separation distance between the first position and at leastone position along segments of roads in the stored road network. Step904 may then include a road in the set of candidate roads when theseparation distance associated with that road falls below the specifiedthreshold distance, e.g., ten meters, twenty-five meters, or anyadditional or alternate distance apparent to one of skill in the art.

Step 906 then selects a road from within the identified set of candidateroads having a minimum separation distance (i.e., the road that isclosest to the first position), and subsequently indexes this selectedcandidate road against stored route network data, e.g., route networkdata 174 of FIG. 1, to identify a route link associated with theselected road. As described above in reference to FIG. 12, the selectedroute link may be associated with a link identifier that points toadditional information related to the link, as described above.

Once step 906 identifies a route link associated with the firstposition, step 908 selects a subset of additional data elements from thereceived positional information for further processing. In anembodiment, the selected subset includes a specified number ofadditional data elements, for example, fifty data elements, one hundreddata elements, or any additional or alternate number of data elementsapparent to one of skill in the art, captured at times later than thefirst data element.

However, the methods of FIG. 9 are not limited to subsets that include aspecified number of data elements, and in an additional embodiment, thesubset may include data elements received and captured over a specifiedtime period. In such an embodiment, the number of data elements includedwithin the selected subset may be determined by the specified durationand by a sampling rate of the GPS receiver of the GPS-equipped clientdevice.

Step 910 then identifies a position representative of the selectedsubset of data elements. In an embodiment, the representative positionmay be associated with a final data element within the selected subset.For example, if the selected subset includes fifty positions, therepresentative position may be that associated with the fiftieth dataelement. However, in additional embodiments, the position representativeof the selected subset may be associated with a first data elementwithin the selected subset, or any other data elements within theselected subset apparent to one of skill in the art. Moreover, one ormore of a size of the subset of data elements, or a representativeposition within the subset, may be determined adaptively in response tothe correlation process.

Step 912 then identifies a set of candidate roads that are proximate tothe representative position (e.g., those roads having correspondingcurves or shapes that are proximate to the representative position). Asdescribed above, step 912 may compute a separation distance between therepresentative position and at least one position along segments ofroads in the stored road network. Step 912 may include a road in the setof candidate roads when the separation distance associated with thatroad falls below a specified threshold distance, e.g., ten meters,twenty-five meters, or any additional or alternate distance apparent toone of skill in the art.

Step 914 selects the road from within the identified set of candidateroads having a minimum separation distance (i.e., the road that isclosest to the representative position). Step 914 also indexes thisselected candidate road against stored route network data, e.g., routenetwork data 174 of FIG. 1, to identify a route link associated with theroad selected for the second position. As described above, step 912 maymatch a road name of road selected for the representative position witha road name and/or an alternate road name within the stored routenetwork data to identify the corresponding route link.

Moreover, as described above, the identification of a route link in step912 may also determine whether a travel direction associated with theidentified route link matches a travel direction at the representativeposition in the received positional information. In an embodiment, step912 may select an alternate road from within the set of candidate roadshaving a direction that matches the travel direction of therepresentative position. However, in additional embodiments, thedetermination and remediation of directional mismatches are predicatedon a nature of the received positional information, as described abovein reference to FIG. 7.

Step 916 then determines whether the road associated with therepresentative position, as selected in step 914, is directly connectedto the road associated with the initial position, e.g., as selected instep 904. As described above in reference to FIG. 7, step 916 deems theselected roads to be directly connected when certain connectivitycriteria are satisfied. In such an embodiment, method 800 of FIG. 8,described above, may be implemented as a part of step 914 to determinewhether the certain connectivity criteria are satisfied, and hence,whether the selected roads are directly connected.

If step 916 determines that the selected roads are not directlyconnected, then step 918 discards the selected road associated with therepresentative position. Step 920 then determines whether additionalroads remain within the set of candidate roads associated with therepresentative position.

If step 920 determines that additional roads remain in the set ofcandidate roads, then method 900 passes back to step 914, which selectsan additional road from within the set of candidate roads associatedwith the representative position. For example, the additional road maybe that remaining road within the set of candidate roads having aminimum separation distance.

However, if step 920 determines that no roads remain within the set ofcandidate roads, step 922 reduces a size of the selected subset, andmethod 900 then passes back to step 910, which identifies a positionrepresentative of the newly-reduced subset of positions. In anembodiment, step 920 may reduce the size of the selected subset bytwenty-five percent, fifty percent, or by any additional or alternatefactor apparent to one of skill in the art. In such an embodiment, aposition representative of the reduced subset may be temporally closerto the initial position, thereby increasing a likelihood that a roadapproximating the new representative position may intersect a roadapproximating the initial position.

However, if step 916 determines that the candidate roads are directlyconnected, i.e., that the connectivity criteria is satisfied, then thecorresponding route link or links are stored in step 924, along with anycorresponding linking node. Step 926 then determines whether additionalpositions within the received positional information require processing.

If step 926 determines that additional positions within the receivedpositional information require correlation with the stored map and routenetwork data, then step 928 sets the representative position, selectedabove in step 910, as a new first position, and method 900 loops back tostep 908. Step 908 then selects a subset of additional data elementsfrom the received positional information, as described above.

However, if step 926 determines that each position within the receivedpositional information has been correlated with the stored map and routenetwork data, step 930 generates the routing graph corresponding to thereceived positional information from the stored route links andconnecting nodes, and method 900 is complete and finishes in step 932.In an embodiment, step 930 returns the generated routing graph to step404 of FIG. 4 for additional processing.

In the embodiments described above, a position associated with a dataelement is correlated against stored map data to identify a candidateset of roads that are proximate to the position. However, the presentinvention is not limited to such correlations, and in additionalembodiments, correlations of prior positions along a single road may beused to adaptively identify roads that are proximate to a futureposition. Such an adaptive identification can, in certain situations,reduce the computational effort necessary to generate a routing graphcorresponding to a received set of positional information.

FIG. 10 illustrates an exemplary method 1000 for generating portions ofa routing graph based on previously-correlated position data, accordingto an embodiment of the invention. In an embodiment, exemplary method1000 may be implemented as in conjunction with the exemplary methods ofFIGS. 7 and 9 to identify candidate road or road segments that may beproximate to a position and to construct portions of routing graphs thatare associated with this position. However, in additional embodiments,exemplary method 1000 may be used to independently generate a portion ofa routing graph associated with a subsequent position based oncorrelations of prior positions.

In FIG. 10, step 1002 identifies a plurality of successive positionswithin a set of received positional information that are proximate to aparticular road. In an embodiment, the successive positions mayrepresent positions associated with successively-data elements in a setof received positional information, as described above in reference toFIG. 7. Additionally or alternatively, the successive positions may bepositions representative of subsets of received positional information,as described above in reference to FIG. 9. In such embodiments,exemplary methods of FIGS. 7 and 9 may be implemented to identify ashared route link common with each of the first positions identified instep 1002, and further, a direction of travel associated with the sharedroute link.

Step 1004 then identifies a second position in the received positionalinformation that, in an embodiment, was captured later than thosepositions identified in step 1002. For example, the second position mayimmediately follow the positions identified in step 1002, may beseparated from the identified position by a specific time period or aspecified number of data elements, or may be representative of anadditional subset of data elements in the received positionalinformation, as described above in reference to FIG. 9.

Once the second position is identified, step 1006 then identifies a setof candidate roads within a stored road network, e.g., map data 172 ofFIG. 1, that may be proximate to the second position (e.g., those roadshaving corresponding curves or shapes that are proximate to the secondposition). In an embodiment, the identified set of candidate roads mayinclude one or more roads that intersect the particular road (i.e., thatroad proximate to the successive positions identified in step 1002)along the direction of travel associated with the particular road.

For example, and in reference to routing graph 500 of FIG. 5, step 1002may identify a plurality of positions proximate to “14^(th) St.,” e.g.,link 505, and may determine that these positions are associated with a“southbound” direction of travel. In response to a second positionidentified in step 1004, step 1006 may then propose one or morecandidate roads that intersect “14^(th) St.” at positions south of theidentified plurality of positions.

Step 1008 then computes a separation distance between each candidateroad proposed in step 1006 and the second position, as described above.In an embodiment, the separation distance computed in step 1008 for eachcandidate road may represent a distance between the second position andat least one position along the candidate road, e.g., along a curve orshape associated with the candidate road. Based on the computedseparation distances, step 1010 then determines whether any of theproposed candidate roads are proximate to the second position.

In an embodiment, the determination in step 1010 selects that roadwithin the proposed candidate roads having a minimum separation distance(i.e., the candidate road that is closest to the second position). Step1010 then compares the minimum separation distance of the identifiedcandidate road with a specified threshold distance, for example, tenmeters, twenty meters, or any additional or alternate distance apparentto one of skill in the art. If the minimum separation distanceassociated with the road selected in step 1010 is smaller than thespecified threshold distance, then step 1010 may identify that selectedroad as proximate to the second position.

Further, as described above, the determination in step 1010 may also bebased on a comparison between a travel direction associated with thesecond position and a travel direction associated with the identifiedcandidate road. In such an embodiment, if a directional mismatch occursbetween the identified candidate road and the second position, step 1010may discard the identified candidate position and select anotherproposed candidate road, e.g., that remaining candidate road having aminimum separation distance. Additionally, as described above, theremediation of a directional mismatch in step 1010 may be predicated ona nature of the received positional information.

If step 1010 determines the identified candidate road is proximate tothe second position, then step 1012 indexes the candidate road againststored route network data to identify a route link associated with thatidentified candidate road. For example, step 1012 can match a name ofthe identified candidate road with a road name and/or alternate roadname or a route link to identify the route link, as described above.

Step 1014 then constructs a portion of the routing graph correspondingto the received positional information by linking together the routelinks associated with the identified successive positions and the secondposition. For example, if the route link identified in step 1012directly intersects that route link associated with successive positionsidentified in step 1002, then step 1014 may link these route linkstogether at a node, as described above in reference to FIGS. 7 and 9.

However, the route link identified in step 1012 may not directlyintersect the route link associated with the successive positionsidentified in step 1002. For example, in reference to routing graph 500of FIG. 5, route link 503 never directly intersects route link 517. Insuch an embodiment, step 1014 may string together directly-connectedroute links between the route links identified in steps 1002 and 1012 togenerate a portion of a routing graph that describes a route between theidentified successive positions and the second position.

Step 1016 then stores the route link identified in step 1012 and theportion of the routing graph constructed in step 1014. Method 1000 isthen complete and finished in step 1018. In an embodiment, method 1000could pass back to step 720 of FIG. 7 and step 924 of FIG. 9, whichdetermine whether additional positions within the received positionalinformation require processing.

However, if step 1010 determines that none of the proposed roads or roadsegments are proximate to the second position, then method 1000 isunable to identify a proximate road in step 1020. In such an embodiment,method 1000 could pass back to step 1006, which may propose anadditional set of candidate roads for processing. For example, step 1006could propose an increased number of candidate roads, and additionallyor alternatively, step 1006 could expand a geographic region from whichthese candidate roads are selected.

The embodiments of FIG. 10 are described in terms of a single, secondposition. However, method 1000 is not limited to the correlation of mapdata to a single second position, and in an additional embodiment,method 1000 may be applied to any plurality of second positions toidentify route links without departing from the spirit or scope of theinvention.

FIG. 11 illustrates an exemplary method 1100 for generating textualdirections based on a routing graph, according to an embodiment of theinvention. In an embodiment, method 1100 is implemented as part of step406 of FIG. 4 to generate textual directions based on a routing graphcorresponding to the received positional information. However, in anadditional embodiment, method 1100 may be independently implemented togenerate a set of textual directions for traversing a path correspondingto any additional or alternate routing graph.

In FIG. 11, step 1102 accesses link information corresponding to one ormore links of a routing graph, e.g., routing graph 600 of FIG. 6. In anembodiment, step 1102 receives a list of links associated with theparticular routing graph and, using the list of links, accesses storedroute network data associated with the list of links. However, in anadditional embodiment, step 1102 may directly receive link informationassociated with the one or more links of the particular routing graph,and as such, need to access the stored network route data.

Step 1104 then processes the link information to eliminate internallinks from within the generated routing graph. In an embodiment, step1104 identifies internal links bated on an internal link indicator inthe received link information, e.g., internal link indicator 1286 inFIG. 12. Step 1104 may then eliminate the identified internal links bycombining the information about the internal links with informationassociated with one or more non-internal links. For example, step 1104may combine the link information for the internal links withcorresponding link information for a previous link or a subsequent link.

Step 1106 then processes alternate road names of the remaining links ofthe generated routing graph to eliminate redundant links. In anembodiment, step 1106 may compare whether a road name, or an alternativeroad name, of one link matches a road name, or an alternate road name,of an adjacent link. If the names, or alternate road names, of adjacentlinks match, step 1106 then determines whether one of the adjacent linksinvolves a turn. If neither adjacent link involves a turn, then step1106 combines the adjacent links into a single link.

Step 1108 then creates preliminary maneuvers from the processed linksand corresponding link information. In an embodiment, step 1108 combinesone or more links to generate a preliminary maneuver, and generatescorresponding preliminary maneuver information based on link informationof the one or more links. In such embodiments, maneuver information maybe structured in a fashion similar to the link information describedabove with respect to FIG. 12. Further, when a link has been combinedwith one or more other links, e.g., through a combination of internallinks or matching road names or alternate road names, step 1108 maygenerate only a single preliminary maneuver for the combined linkinformation.

Once preliminary maneuvers are created in step 1108, step 1110identifies and combines preliminary maneuvers that are involved in ahighway interchange into a single maneuver. The resulting combinedmaneuvers, referred to as “interchange maneuvers,” describe entrances orexits associated with a limited-access road. As described above, thelimited access road may be a fully controlled limited-access road or apartially-controlled limited-access road.

Step 1112 then eliminates redundant interchange maneuvers from the setof preliminary maneuvers. For example, step 1112 may eliminate aninterchange maneuver when the road name or the alternate road name ofthe maneuver is the same as a previous maneuver.

Step 1114 then generates textual directions for the created maneuvers,e.g., textual directions 600 of FIG. 6. In an embodiment, step 1114 maygenerate textual directions that include, but are not limited to,phrases such as “continue to follow,” and “merge.” Further, suchgenerated directions may identify a particular road name or a roadnumber when a maneuver includes multiple road names, when the maneuverincludes a turn (e.g., a left turn or a right turn), or when two linksthat share a road name or an alternate road name have been combined toform the maneuver. Further, for example, the generates directions mayalso specify a distance travelled while executing each created maneuver.

Method 1100 is then complete and finishes in step 1116. In anembodiment, step 1114 may output the generated textual directions tostep 406 of FIG. 4, which may subsequently store and or display thetextual directions.

Although the processes of FIG. 11 has been disclosed for purposes ofgenerating textual directions from a routing graph and correspondinglink information, embodiments of the present invention are not limitedto such exemplary processes. In additional embodiments, the generationof textual directions from routing graphs may be implemented using oneor more additional or alternate processes, such as those described inU.S. Pat. No. 7,283,906 to Gearhart, which issued on Oct. 16, 2007.

Various embodiments have been described herein with reference to theaccompanying drawings. It will, however, be evident that variousmodifications and changes may be made thereto, and additionalembodiments may be implemented, without departing from the broader scopeof the invention as set forth in the claims that follow.

Further, other embodiments will be apparent to those skilled in the artfrom consideration of the specification and practice of one or moreembodiments of the invention disclosed herein. It is intended,therefore, that this disclosure and the examples herein be considered asexemplary only, with a true scope and spirit of the invention beingindicated by the following listing of exemplary claims.

1-28. (canceled)
 29. A computer-implemented method, comprising:determining, using at least one processor, a first road corresponding toa first positional data element and a second road corresponding to asecond positional data element; determining, using the at least oneprocessor, whether the first road intersects the second road; andgenerating, using the at least one processor, a first portion of arouting graph that includes route links representative of the first andsecond roads when the first and second roads intersect, the route linksbeing connected within the routing graph by a node.
 30. The method ofclaim 29, further comprising: when the first road is determined not tointersect the second road, identifying a third road corresponding to athird positional data element; determining, using the at least oneprocessor, whether the first road intersects a road associated with thethird positional data element; and generating, using the at least oneprocessor, a second portion of the routing graph that includes routelinks representative of the first and third roads when the first andthird roads intersect.
 31. The method of claim 29, further comprising:obtaining the first and second positional data elements, the first andsecond positional data elements being associated with correspondingfirst and second times, the first time being subsequent to the secondtime; and identifying a first route link corresponding to the firstpositional data element and a second route link corresponding to thesecond positional data element, the first portion of the routing graphincluding the first and second route links, and the first and secondroute links being connected within the routing graph by the node. 32.The method of claim 31, wherein: the first and second positional dataelements specify longitudes and latitudes at corresponding ones of thefirst and second times; the first road corresponds to the longitude andlatitude specified by the first positional data element; and the secondroad corresponds to the longitude and latitude specified by the secondpositional data element.
 33. The method of claim 32, further comprisingcorrelating the longitudes and latitudes of the first and second roadswith mapping data to identify the first and second route links, thefirst route link being associated with the first road, and the secondroute link being associated with the second road.
 34. The method ofclaim 32, further comprising: computing values indicative ofdisplacements between the longitude and latitude specified by the firstpositional element and longitudes and attitudes of positions withincorresponding ones of a plurality of candidate roads; and selecting oneof the candidate roads as the first road, the first road beingassociated with a minimum of the computed values.
 35. The method ofclaim 31, further comprising: obtaining information identifying: a shapeassociated with a portion of the first road that corresponds to thefirst route link; and a shape associated with a portion of the secondroad that corresponds to the second route link; and determining whetherthe first road intersects the second road based on the shapes associatedwith the first and second road portions.
 36. The method of claim 31,further comprising: obtaining connectivity information associated withthe first and second route links; and determining whether the first andsecond roads intersect based on the obtained connectivity information.37. The method of claim 31, further comprising: determining a directionof travel associated with at least one of the first positional dataelement or the second positional data element; and identifying at leastone of the first route link or the second route link based on thedetermined travel direction.
 38. The method of claim 29, furthercomprising generating textual directions for traversing a pathrepresentative of the routing graph.
 39. An apparatus, comprising: astorage device that stores a set of instructions; and at least oneprocessor coupled to the storage device, the at least one processorbeing operative with the set of instructions in order to: determine afirst road corresponding to a first positional data element and a secondroad corresponding to a second positional data element; determinewhether the first road intersects the second road; and generate a firstportion of a routing graph that includes route links representative ofthe first and second roads when the first and second roads intersect,the route links being connected within the routing graph by a node. 40.The apparatus of claim 39, wherein the at least one processor is furtheroperative with the set of instructions to: when the first road isdetermined not to intersect the second road, identify a third roadcorresponding to a third positional data element; determine whether thefirst road intersects a road associated with the third positional dataelement; and generate a second portion of the routing graph thatincludes route links representative of the first and third roads whenthe first and third roads intersect.
 41. The apparatus of claim 39,wherein the at least one processor is further operative with the set ofinstructions to: obtain the first and second positional data elements,the first and second positional data elements being associated withcorresponding first and second times, the first time being subsequent tothe second time; and identify a first route link corresponding to thefirst positional data element and a second route link corresponding tothe second positional data element, the first portion of the routinggraph including the first and second route links, and the first andsecond route links being connected within the routing graph by the node.42. The apparatus of claim 41, wherein: the first and second positionaldata elements specify longitudes and latitudes at corresponding ones ofthe first and second times; the first road corresponds to the longitudeand latitude specified by the first positional data element; the secondroad corresponds to the longitude and latitude specified by the secondpositional data element; and the at least one processor is furtheroperative with the set of instructions to correlate the longitudes andlatitudes of the first and second roads with mapping data to identifythe first and second route links, the first route link being associatedwith the first road, and the second route link being associated with thesecond road.
 43. The apparatus of claim 42, wherein the at least oneprocessor is further operative with the set of instructions to: computevalues indicative of displacements between the longitude and latitudespecified by the first positional element and longitudes and attitudesof positions within corresponding ones of a plurality of candidateroads; and select one of the candidate roads as the first road, thefirst road being associated with a minimum of the computed values. 44.The apparatus of claim 41, wherein the at least one processor is furtheroperative with the set of instructions to: obtain informationidentifying: a shape associated with a portion of the first road thatcorresponds to the first route link; and a shape associated with aportion of the second road that corresponds to the second route link;and determine whether the first road intersects second road based on theshapes associated with the first and second road portions.
 45. Theapparatus of claim 41, wherein the at least one processor is furtheroperative with the set of instructions to: obtain connectivityinformation associated with the first and second route links; anddetermine whether the first and second roads intersect based on theobtained connectivity information.
 46. The apparatus of claim 39,wherein the at least one processor is further operative with the set ofinstructions to: determine a direction of travel associated with atleast one of the first positional data element or the second positionaldata element; and identify at least one of the first route link or thesecond route link based on the determined travel direction.
 47. Themethod of claim 39, wherein the at least one processor is furtheroperative with the set of instructions to generate textual directionsfor traversing a path representative of the routing graph.
 48. Atangible, non-transitory computer-readable medium that stores a set ofinstructions that, when executed by at least one processor, cause the atleast one processor to perform a method comprising: determining a firstroad corresponding to a first positional data element and a second roadcorresponding to a second positional data element, the first and secondpositional data elements being associated with corresponding first andsecond times, the first time being subsequent to the second time;determining whether the first road intersects the second road; andgenerating a first portion of a routing graph that includes route linksrepresentative of the first and second roads when the first and secondroads intersect, the route links being connected within the routinggraph by a node.